Fast Planning Algorithm of Bending Sequences for Progressive Press-Working.
نویسندگان
چکیده
منابع مشابه
gpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملa fast algorithm for exonic regions prediction in dna sequences
the main purpose of this paper is to introduce afast method for gene prediction in dna sequences based on the period-3 property in exons. first, the symbolic dna sequences are converted to digital signal using the eiip method. then, to reduce the effect of background noise in the period-3 spectrum, we use the discrete wavelet transform (dwt) at three levels and apply it on the input digital sig...
متن کاملgpaligner: a fast algorithm for global pairwise alignment of dna sequences
bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. many computational algorithms have been applied for solving the sequence alignment problem. dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods applied t...
متن کاملAn algorithm for progressive multiple alignment of sequences with insertions.
Dynamic programming algorithms guarantee to find the optimal alignment between two sequences. For more than a few sequences, exact algorithms become computationally impractical, and progressive algorithms iterating pairwise alignments are widely used. These heuristic methods have a serious drawback because pairwise algorithms do not differentiate insertions from deletions and end up penalizing ...
متن کاملA Fast Algorithm for Liver Surgery Planning
Assume that a simplified liver model consists of some vein cells and liver cells. Such a liver model contains two kinds of components, the vein component and the liver components, each of them consists of cells which are 26connected. The vein component has a tree-shape topology. Suppose that the vein component has already been cut into two parts, and one of them is diseased. Liver surgery plann...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Japan Society for Precision Engineering
سال: 1999
ISSN: 1882-675X,0912-0289
DOI: 10.2493/jjspe.65.267